The Odd-Point Ternary Approximating Schemes
نویسندگان
چکیده
We present a general formula to generate the family of odd-point ternary approximating subdivision schemes with a shape parameter for describing curves. The influence of parameter to the limit curves and the sufficient conditions of the continuities from 0 C to 5 C of 3and 5-point schemes are discussed. Our family of 3-point and 5-point ternary schemes has higher order of derivative continuity than the family of 3-point and 5-point schemes presented by [16]. Moreover, a 3-point ternary cubic B-spline is special case of our family of 3-point ternary scheme. The visual quality of schemes with examples is also demonstrated.
منابع مشابه
A ternary 4-point approximating subdivision scheme
In the implementation of subdivision scheme, three of the most important issues are smoothness, size of support, and approximation order. Our objective is to introduce an improved ternary 4-point approximating subdivision scheme derived from cubic polynomial interpolation, which has smaller support and higher smoothness, comparing to binary 4-point and 6-point schemes, ternary 3-point and 4-poi...
متن کاملTernary approximating non - stationary subdivision schemes for curve design
In this paper, an algorithm has been introduced to produce ternary 2m-point (for any integer m≥ 1) approximating non-stationary subdivision schemes which can generate the linear spaces spanned by {1; cos(α.); sin(α.)}. The theory of asymptotic equivalence is being used to analyze the convergence and smoothness of the schemes. The proposed algorithm can be consider as the non-stationary counter ...
متن کاملUnification and Application of 3-point Approximating Subdivision Schemes of Varying Arity
In this paper, we propose and analyze a subdivision scheme which unifies 3-point approximating subdivision schemes of any arity in its compact form and has less support, computational cost and error bounds. The usefulness of the scheme is illustrated by considering different examples along with its comparison with the established subdivision schemes. Moreover, B-splines of degree 4and well know...
متن کاملConstruction of Ternary Approximating Subdivision Schemes
In this, an algorithm to produce ternary m-point (for any integer m ≥ 2) approximating subdivision scheme has been introduced that can generate the families of C limiting curves. The proposed scheme has developed using the uniform B-spline blending functions and its convergence is analyzed by Laurent polynomial method. It is concluded that the existing 2-point, 3-point and 5-point ternary appro...
متن کاملThe m-Point Quaternary Approximating Subdivision Schemes
In this article, the objective is to introduce an algorithm to produce the quaternary m-point (for any integer ) approximating subdivision schemes, which have smaller support and higher smoothness, comparing to binary and ternary schemes. The proposed algorithm has been derived from uniform B-spline basis function using the Cox-de Boor recursion formula. In order to determine the convergence an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- American J. Computational Mathematics
دوره 1 شماره
صفحات -
تاریخ انتشار 2011